منابع مشابه
Duality in nondifferentiable minimax fractional programming with generalized convexity
A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.
متن کاملOptimality and Duality for Minimax Fractional Semi-Infinite Programming
The purpose of this paper is to consider a class of nonsmooth minimax fractional semi-infinite programming problem. Based on the concept of H − tangent derivative, a new generalization of convexity, namely generalized uniform ( , ) H B ρ − invexity, is defined for this problem. For such semi-infinite programming problem, several sufficient optimality conditions are established and proved by uti...
متن کاملSufficiency and Duality in Minimax Fractional Programming with Generalized (φ, Ρ)-invexity
Amongst various important applications, one important application of nonlinear programming is to maximize or minimize the ratio of two functions, commonly called fractional programming. The characteristics of fractional programming problems have been investigated widely [1, 6, 10] and [13]. In noneconomic situations, fractional programming problems arisen in information theory, stochastic progr...
متن کاملDuality in nondifferentiable minimax fractional programming with B-(p, r)-invexity
* Correspondence: drizhar@kfupm. edu.sa Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia Full list of author information is available at the end of the article Abstract In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution t...
متن کاملDuality in Minimax Fractional Programming Problem Involving Nonsmooth Generalized (F,α,ρ,d)-Convexity
In this paper, we discuss nondifferentiable minimax fractional programming problem where the involved functions are locally Lipschitz. Furthermore, weak, strong and strict converse duality theorems are proved in the setting of Mond-Weir type dual under the assumption of generalized (F,α,ρ,d)-convexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1995
ISSN: 0263-6115
DOI: 10.1017/s1446788700038362